Bipartite ranking: risk, optimality, and equivalences
نویسندگان
چکیده
We present a systematic study of the bipartite ranking problem, with the aim of delineating its connections to the class-probability estimation problem. Our study focuses on the properties of the statistical risk for bipartite ranking, which is closely related to the area under the ROC curve: we establish alternate representations of the risk, relate the Bayes-optimal risk to a class of probability divergences, and characterise the set of Bayesoptimal scorers for the risk. We further study properties of a generalised class of bipartite risks, based on the p-norm push of (Rudin, 2009). Our analysis is based on the rich framework of proper losses, which are the central tool in the study of class-probability estimation. We show how this analytic tool makes transparent the generalisations of several existing results, such as the equivalence between four seemingly disparate risks from bipartite ranking and class-probability estimation. A novel practical implication of our analysis is the design of a new family of losses with comparable empirical performance to the p-norm push.
منابع مشابه
Upper bounds and aggregation in bipartite ranking
One main focus of learning theory is to find optimal rates of convergence. In classification, it is possible to obtain optimal fast rates (faster than n−1/2) in a minimax sense. Moreover, using an aggregation procedure, the algorithms are adaptive to the parameters of the class of distributions. Here, we investigate this issue in the bipartite ranking framework. We design a ranking rule by aggr...
متن کاملRanking Multi-Class Data: Optimality and Pairwise Aggregation
It is the primary purpose of this paper to set the goals of ranking in a multiple-class context rigorously, following in the footsteps of recent results in the bipartite framework. Under specific likelihood ratio monotonicity conditions, optimal solutions for this global learning problem are described in the ordinal situation, i.e. when there exists a natural order on the set of labels. Criteri...
متن کاملA ranking approach to global optimization
We consider the problem of maximizing an unknown function f over a compact and convex set X ⊂ R using as few observations f(x) as possible. We observe that the optimization of the function f essentially relies on learning the induced bipartite ranking rule of f . Based on this idea, we relate global optimization to bipartite ranking which allows to address problems with high dimensional input s...
متن کاملBayes-Optimal Scorers for Bipartite Ranking
We address the following seemingly simple question: what is the Bayes-optimal scorer for a bipartite ranking risk? The answer to this question helps elucidate the relationship between bipartite ranking and other established learning problems. We show that the answer is non-trivial in general, but may be easily determined for certain special cases using the theory of proper losses. Our analysis ...
متن کاملBipartite Ranking: a Risk-Theoretic Perspective
We present a systematic study of the bipartite ranking problem, with the aim of explicating its connections to the class-probability estimation problem. Our study focuses on the properties of the statistical risk for bipartite ranking with general losses, which is closely related to a generalised notion of the area under the ROC curve: we establish alternate representations of this risk, relate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014